On Turán numbers for disconnected hypergraphs

نویسندگان

چکیده

We introduce the following simpler variant of Tur\'an problem: Given integers $n>k>r\geq 2$ and $m\geq 1$, what is smallest integer $t$ for which there exists an $r$-uniform hypergraph with $n$ vertices, edges $m$ connected components such that any $k$-subset vertex set contains at least one edge? prove some general estimates this quantity its limit, normalized by $\binom{n}{r}$, as $n\rightarrow \infty$. Moreover, we give a complete solution problem particular case when $k=5$, $r=3$ 2$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turán numbers for Berge - hypergraphs and related 1 extremal problems

4 Let F be a graph. We say that a hypergraph H is a Berge-F if there is a bijection 5 f : E(F )→ E(H) such that e ⊆ f(e) for every e ∈ E(F ). Note that Berge-F actually 6 denotes a class of hypergraphs. The maximum number of edges in an n-vertex r-graph 7 with no subhypergraph isomorphic to any Berge-F is denoted exr(n,Berge-F ). In this 8 paper we establish new upper and lower bounds on exr(n,...

متن کامل

Turán Numbers for Forests of Paths in Hypergraphs

The Turán number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P denote the family of r-uniform loose paths on edges, F(k, l) denote the family of hypergraphs consisting of k disjoint paths from P , and L (r) denote an r-uniform linear path on edges. We determine precisely exr(n;F(k, l)) and exr(n; k · L ), a...

متن کامل

On Ramsey - Turán type theorems for hypergraphs

Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a subgraph isomorphic to H’. We show that if ...

متن کامل

On two Turán Numbers

Let Hð3;1Þ denote the complete bipartite graph K3;3 with an edge deleted. For given graphs G and F , the Turán numbers exðG; FÞ denote the maximum number of edges in a subgraph of G containing no copy of F . We prove that exðKn;n;Hð3; 1ÞÞ ð4= ffiffiffi 7 p n þOðnÞ 1:5119n þOðnÞ and that exðKn;Hð3; 1ÞÞ ð1=5Þ ffiffiffiffiffi 15 p n þOðnÞ 0:7746n þ OðnÞ, which improve earlier results of Mubayi-Wes...

متن کامل

Turán Problems on Non-Uniform Hypergraphs

A non-uniform hypergraph H = (V,E) consists of a vertex set V and an edge set E ⊆ 2V ; the edges in E are not required to all have the same cardinality. The set of all cardinalities of edges in H is denoted by R(H), the set of edge types. For a fixed hypergraph H, the Turán density π(H) is defined to be limn→∞maxGn hn(Gn), where the maximum is taken over all H-free hypergraphs Gn on n vertices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Mathematica Hungarica

سال: 2023

ISSN: ['0001-5954', '0236-5294', '1588-2632']

DOI: https://doi.org/10.1007/s10474-023-01340-8